Subset Synchronization and Careful Synchronization of Binary Finite Automata
نویسندگان
چکیده
منابع مشابه
Subset Synchronization and Careful Synchronization of Binary Finite Automata
We consider the following generalized notion of synchronization: A word is called a reset word of a subset of states of a deterministic finite automaton if it maps all states of the set to a unique state. It is known that the minimum length of such words is superpolynomial in worst cases, namely in a series of substantially nontransitive automata. We present a series of transitive binary automa...
متن کاملSubset Synchronization of Transitive Automata
We consider the following generalized notion of synchronization: A word is called a reset word of a subset of states of a deterministic finite automaton if it maps all states of the set to a unique state. It is known that the minimum length of such words is superpolynomial in worst cases, namely in a series of substantially nontransitive automata. We present a series of transitive binary automa...
متن کاملSubset Synchronization in Monotonic Automata
We study extremal and algorithmic questions of subset synchronization in monotonic automata. We show that several synchronization problems that are hard in general automata can be solved in polynomial time in monotonic automata, even without knowing a linear order of the states preserved by the transitions. We provide asymptotically tight lower and upper bounds on the maximum length of a shorte...
متن کاملSynchronization of Finite Automata
Methods allowing the design of a synchronized sequential machine, working in the fundamental mode, and realizing the behaviour of any given finite automaton are studied from a theoretical point of view; the transformations of the initial flow table lead in a natural way to the definition and to the use of master-slave flip-flops. 1. Introduetion The aim of this paper is to give a theoretical ba...
متن کاملSynchronization and Stability of Finite Automata
Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors in such a way that each vertex has one edge of each color leaving it. The automaton is called synchronized if there exists an input word that maps all vertices into the same fixed vertex. The road coloring conjecture ask...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2016
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054116500167